Linear time, high-rate, list-recoverable codes from expander graphs
نویسندگان
چکیده
We show that expander codes, when properly instantiated, are high-rate list-recoverable codes with linear-time list recovery algorithms. List recoverable codes have been useful recently in constructing efficiently listdecodable codes, as well as explicit constructions of matrices for compressive sensing and group testing. Previous list-recoverable codes with linear-time decoding algorithms have all had rate at most 1/2; in contrast, our codes can have rate 1− ε for any ε > 0.
منابع مشابه
Linear-Time List Recovery of High-Rate Expander Codes
We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have been useful recently in constructing efficiently list-decodable codes, as well as explicit constructions of matrices for compressive sensing and group testing. Previous list recoverable codes with linear-time decoding algorithms hav...
متن کاملLocal List Recovery of High-Rate Tensor Codes & Applications
In this work, we give the first construction of high-rate locally list-recoverable codes. Listrecovery has been an extremely useful building block in coding theory, and our motivation is to use these codes as such a building block. In particular, our construction gives the first capacity-achieving locally list-decodable codes (over constant-sized alphabet); the first capacity achieving globally...
متن کاملExpander-Based Constructions of Efficiently Decodable Codes
We present several novel constructions of codes which share the common thread of using expander (or expander-like) graphs as a component. The expanders enable the design of efficient decoding algorithms that correct a large number of errors through various forms of “voting” procedures. We consider both the notions of unique and list decoding, and in all cases obtain asymptotically good codes wh...
متن کاملAverage-radius list-recovery of random linear codes: it really ties the room together
We analyze the list-decodability, and related notions, of random linear codes. This has been studied extensively before: there are many different parameter regimes and many different variants. Previous works have used complementary styles of arguments—which each work in their own parameter regimes but not in others—and moreover have left some gaps in our understanding of the list-decodability o...
متن کاملA Class of Real Expander Codes Based on Projective- Geometrically Constructed Ramanujan Graphs
Quite recently, codes based on real field are gaining momentum in terms of research and applications. In high-performance computing, these codes are being explored to provide fault tolerance under node failures. In this paper, we propose novel real cycle codes based on expander graphs. The requisite graphs are the Ramanujan graphs constructed using incidence matrices of the appropriate projecti...
متن کامل